From program verification to program synthesis

Program Transformation for Program Verification

We present a transformational approach to program verification and software model checking that uses three main ingredients: (i) Constraint Logic Programming (CLP), (ii) metaprogramming and program specialization, and (iii) proof by transformation. (i) Constraints are used for representing in a compact way (finite or infinite) sets of values or memory states, and logic is used for expressing pr...

Program Verification

Inductive Program Synthesis: From Theory to Application

We present an approach to folding of finite program terms based on the detection of recurrence relations in a single given term which is considered as the kth unfolding of an unknown recursive program. Our approach goes beyond Summers’ classical approach of inductive program synthesis in several aspects and allows to deal with a larger class of programming problems. We show how inductive synthe...

From Rewriting Logic, to Programming Language Semantics, to Program Verification

Rewriting logic has proven to be an excellent formalism to define executable semantics of programming languages, concurrent or not, and then to derive formal analysis tools for the defined languages with very little effort, such as model checkers. In this paper we give an overview of recent results obtained in the context of the rewriting logic semantics framework K, such as complete semantics ...

F: From Program Verification System to Proof Assistant

F is a verification system for ML programs developed collaboratively by Inria and Microsoft Research. ML types are extended with logical predicates that can conveniently express precise specifications for programs (preand postconditions of functions as well as stateful invariants), including functional correctness and security properties. The F typechecker implements a weakest-precondition calc...